Error Correction Capability of Column-Weight-Three LDPC Codes: Part II
نویسندگان
چکیده
The relation between the girth and the error correction capability of column-weight-three LDPC codes is investigated. Specifically, it is shown that the Gallager A algorithm can correct g/2 − 1 errors in g/2 iterations on a Tanner graph of girth g ≥ 10.
منابع مشابه
Error Correction Capability of Column-Weight-Three LDPC Codes
In this paper, we investigate the error correction capability of column-weight-three LDPC codes when decoded using the Gallager A algorithm. We prove that the necessary condition for a code to correct k ≥ 5 errors is to avoid cycles of length up to 2k in its Tanner graph. As a consequence of this result, we show that given any α > 0,∃N such that ∀n > N , no code in the ensemble of column-weight...
متن کاملCheck-hybrid GLDPC codes: Systematic elimination of trapping sets and guaranteed error correction capability
In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (CHGLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes involving a trapping set into super checks corresponding to a 2-error correcting component code. Specifically, we follow two main purposes to construct the check-hyb...
متن کاملFinite Alphabet Iterative Decoders - Part II: Towards Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity
Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation in the error floor region on the Binary Symmetric channel with much lower complexity. In this paper, we introduce a a novel scheme to further increase the guaranteed error correction capability from what is achie...
متن کاملResults on non-uniform error correction using low-density parity-check codes
LDPC codes are state-of-art error correcting codes, included in and the received samples in LDPC-coded systems using M -QAM schemes. physical layer, especially on the forward-error correction code. (FEC) performance. low-density parity check (LDPC) codes can achieve high Using long FECs with short is possible to apply a non-uniform mapping like for example. Low-density parity-check (LDPC) code ...
متن کاملCodes LDPC multi-binaires hybrides et méthodes de décodage itératif
This thesis is dedicated to the analysis and the design of sparse-graph codes for channel coding. The aim is to construct coding schemes having high performance both in the waterfall and in the error-floor regions under iterative decoding. In the first part, a new class of LDPC codes, named hybrid LDPC codes, is introduced. Their asymptotic analysis for memoryless symmetric channel is performed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0807.3582 شماره
صفحات -
تاریخ انتشار 2008